|
The Fermat primality test is a probabilistic test to determine whether a number is a probable prime. ==Concept== Fermat's little theorem states that if ''p'' is prime and , then : If we want to test whether ''p'' is prime, then we can pick random ''as in the interval and see whether the equality holds. If the equality does not hold for a value of ''a'', then ''p'' is composite. If the equality does hold for many values of ''a'', then we can say that ''p'' is probably prime. It might be in our tests that we do not pick any value for ''a'' such that the equality fails. Any ''a'' such that : when ''n'' is composite is known as a ''Fermat liar''. Vice versa, in this case ''n'' is called Fermat pseudoprime to base ''a''. If we do pick an ''a'' such that : then ''a'' is known as a ''Fermat witness'' for the compositeness of ''n''. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Fermat primality test」の詳細全文を読む スポンサード リンク
|